全文获取类型
收费全文 | 5045篇 |
免费 | 784篇 |
国内免费 | 698篇 |
专业分类
电工技术 | 118篇 |
技术理论 | 1篇 |
综合类 | 456篇 |
化学工业 | 105篇 |
金属工艺 | 65篇 |
机械仪表 | 312篇 |
建筑科学 | 134篇 |
矿业工程 | 52篇 |
能源动力 | 34篇 |
轻工业 | 44篇 |
水利工程 | 18篇 |
石油天然气 | 38篇 |
武器工业 | 25篇 |
无线电 | 689篇 |
一般工业技术 | 328篇 |
冶金工业 | 188篇 |
原子能技术 | 7篇 |
自动化技术 | 3913篇 |
出版年
2024年 | 16篇 |
2023年 | 124篇 |
2022年 | 177篇 |
2021年 | 277篇 |
2020年 | 257篇 |
2019年 | 207篇 |
2018年 | 207篇 |
2017年 | 225篇 |
2016年 | 301篇 |
2015年 | 297篇 |
2014年 | 345篇 |
2013年 | 301篇 |
2012年 | 276篇 |
2011年 | 270篇 |
2010年 | 199篇 |
2009年 | 232篇 |
2008年 | 285篇 |
2007年 | 238篇 |
2006年 | 248篇 |
2005年 | 238篇 |
2004年 | 220篇 |
2003年 | 165篇 |
2002年 | 164篇 |
2001年 | 140篇 |
2000年 | 152篇 |
1999年 | 105篇 |
1998年 | 97篇 |
1997年 | 108篇 |
1996年 | 78篇 |
1995年 | 93篇 |
1994年 | 85篇 |
1993年 | 60篇 |
1992年 | 71篇 |
1991年 | 59篇 |
1990年 | 36篇 |
1989年 | 32篇 |
1988年 | 21篇 |
1987年 | 12篇 |
1986年 | 20篇 |
1985年 | 22篇 |
1984年 | 16篇 |
1983年 | 9篇 |
1982年 | 10篇 |
1981年 | 4篇 |
1980年 | 7篇 |
1978年 | 4篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有6527条查询结果,搜索用时 15 毫秒
81.
82.
The paper presents a supervised discriminative dictionary learning algorithm specially designed for classifying HEp-2 cell patterns. The proposed algorithm is an extension of the popular K-SVD algorithm: at the training phase, it takes into account the discriminative power of the dictionary atoms and reduces their intra-class reconstruction error during each update. Meanwhile, their inter-class reconstruction effect is also considered. Compared to the existing extension of K-SVD, the proposed algorithm is more robust to parameters and has better discriminative power for classifying HEp-2 cell patterns. Quantitative evaluation shows that the proposed algorithm outperforms general object classification algorithms significantly on standard HEp-2 cell patterns classifying benchmark1 and also achieves competitive performance on standard natural image classification benchmark. 相似文献
83.
84.
Recently, many local-feature based methods have been proposed for feature learning to obtain a better high-level representation of human behavior. Most of the previous research ignores the structural information existing among local features in the same video sequences, while it is an important clue to distinguish ambiguous actions. To address this issue, we propose a Laplacian group sparse coding for human behavior representation. Unlike traditional methods such as sparse coding, our approach prefers to encode a group of relevant features simultaneously and meanwhile allow as less atoms as possible to participate in the approximation so that video-level sparsity is guaranteed. By incorporating Laplacian regularization the method is capable to ensure the similar approximation of closely related local features and the structural information is successfully preserved. Thus, a compact but discriminative human behavior representation is achieved. Besides, the objective of our model is solved with a closed-form solution, which reduces the computational cost significantly. Promising results on several popular benchmark datasets prove the efficiency and effectiveness of our approach. 相似文献
85.
A near-duplicate document image matching approach characterized by a graphical perspective is proposed in this paper. Document images are represented by graphs whose nodes correspond to the objects in the images. Consequently, the image matching problem is then converted to graph matching. To deal with the instability of object segmentation, a multi-granularity object tree is constructed for a document image. Each level in the tree corresponds to one possible object segmentation, while different levels are characterized by various object granularities. Some graphs can be generated from the tree and the objects associated with each graph may be of different granularities. Two graphs with the maximum similarity are found from the multi-granularity object trees of the two near-duplicate document images which are to be matched. The encouraging experimental results have demonstrated the effectiveness of the proposed approach. 相似文献
86.
87.
88.
Image clustering methods are efficient tools for applications such as content-based image retrieval and image annotation. Recently, graph based manifold learning methods have shown promising performance in extracting features for image clustering. Typical manifold learning methods adopt appropriate neighborhood size to construct the neighborhood graph, which captures local geometry of data distribution. Because the density of data points’ distribution may be different in different regions of the manifold, a fixed neighborhood size may be inappropriate in building the manifold. In this paper, we propose a novel algorithm, named sparse patch alignment framework, for the embedding of data lying in multiple manifolds. Specifically, we assume that for each data point there exists a small neighborhood in which only the points that come from the same manifold lie approximately in a low-dimensional affine subspace. Based on the patch alignment framework, we propose an optimization strategy for constructing local patches, which adopt sparse representation to select a few neighbors of each data point that span a low-dimensional affine subspace passing near that point. After that, the whole alignment strategy is utilized to build the manifold. Experiments are conducted on four real-world datasets, and the results demonstrate the effectiveness of the proposed method. 相似文献
89.
90.
Piero Barone 《时间序列分析杂志》1987,8(2):125-130
Abstract. A method for generating finite independent realizations of a normal multivariate stationary ARMA( p, q ) process is proposed. It is based on an AR (1) representation of an ARMA( p, q ) process allowing for an exact generation of the initial values of the simulation algorithm. Input facilities are supplied in order to assure stationarity and invertibility of the considered process. 相似文献